Comparison of two path restoration schemes in self-healing networks

نویسندگان

  • Yijun Xiong
  • Lorne Mason
چکیده

The state-independent (SI) and state-dependent (SD) path restoration schemes for self-healing networks are studied in this paper. The integer programming (IP) formulations for the spare capacity allocation and restoration flow assignment are first presented. Based on the optimal IP solutions, the SI and SD restoration schemes are then compared quantitatively in terms of spare capacity requirement (SCR), restoration time, VPI (virtual path identifier) redundancy (in ATM) and nodal storage capacity requirement. The comparison is based on spare optimization, single link failure scenario and 100% restoration. The SCR is also compared under single node failure scenario. It is observed that using group VP (virtual path) restoration (for either SI or SD) can substantially reduce the restoration time with only a small increase in spare capacity cost. Further, the SI restoration seems better than the SD restoration for the cases we have studied, at least in spare optimization, as its implementation is relatively easier and the difference in SCR between SI and SD is not significant. The economies of scale in transmission facility cost is also investigated in the paper. 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability

In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...

متن کامل

A new efficient spare capacity allocation algorithm in self-healing MPLS mesh-based survivable networks

Network survivability gauges the ability of a network to support the committed Quality of Services (QoS) continuously in the presence of various failure scenarios. MPLS Mesh-Based network can be used to provide network survivability in case of link and node failure through predesign path protection techniques. In the Preplanned self-healing networks, we have to provision adequate spare capacity...

متن کامل

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks - Networking, IEEE/ACM Transactions on

This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the ...

متن کامل

Comparative Study on Restoration Schemes of Survivable ATM Networks

In self-healing networks, end-to-end restoration schemes have been considered more advantageous than line restoration schemes because of a possible cost reduction of the total capacity to construct a fully restorable network. This paper clarifies the benefit of end-to-end restoration schemes quantitatively through a comparative analysis of the minimum link capacity installation cost. A jointly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2002